منابع مشابه
Forecasting copper price using gene expression programming
Forecasting the prices of metals is important in many aspects of economics. Metal prices are also vital variables in financial models for revenue evaluation, which forms the basis of an effective payment regime using resource policymakers. According to the severe changes of the metal prices in the recent years, the classic estimation methods cannot correctly estimate the volatility. In order to...
متن کامل“Explosive” Programming Controlled by Calculation
In the design of a functional library in the area of data-mining several algorithmic patterns have been identified which call for generic programming. Some of these have to do with flattening functions which arise in a particular group of hierarchical systems. In this paper we describe our efforts to make such functionalities generic. We start by a generic inductive construction of the intended...
متن کاملPrefix Gene Expression Programming
Gene Expression Programming (GEP) is a powerful evolutionary method derived from Genetic Programming (GP) for model learning and knowledge discovery. However, when dealing with complex problems, its genotype under Karva notation does not allow hierarchical composition of the solution, which impairs the efficiency of the algorithm. We propose a new representation scheme based on prefix notation ...
متن کاملGenetic Network Programming Based Rule Accumulation for Agent Control
Multi-agent control is a hot but challenging research topic which covers many research fields, such as evolutionary computation, machine learning, neural networks, etc.. Various approaches have been proposed to guide agents’ actions in different environments. Evolutionary Computation (EC) is often chosen to control agents’ behaviors since it can generate the best control policy through evolutio...
متن کاملAn Integer Programming Approach to Optimal Derivative Accumulation
In automatic differentiation, vertex elimination is one of the many methods for Jacobian accumulation. However, finding the optimal vertex elimination sequence of a computational graph is a hard combinatorial optimization problem. In this paper, we propose an integer programming (IP) technique to tackle this problem, and we develop an IP formulation for it. This enables us to use a standard int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AL-Rafidain Journal of Computer Sciences and Mathematics
سال: 2009
ISSN: 2311-7990
DOI: 10.33899/csmj.2009.163766